Partition of a graph into cycles and isolated vertices
نویسنده
چکیده
Let k, r, n be integers with k ≥ 2, 0 ≤ r ≤ k−1 and n ≥ 10k+3. We prove that if G is a graph of order n such that the degree sum of any pair of nonadjacent vertices is at least n−r, then G contains k vertexdisjoint subgraphs Hi, 1 ≤ i ≤ k, such that V (H1) ∪ . . . ∪ V (Hk) = V (G) and such that Hi is a cycle or isomorphic to K1 for each i with 1 ≤ i ≤ r, and Hi is a cycle for each i with r + 1 ≤ i ≤ k.
منابع مشابه
Partitioning graphs into paths or cycles of prescribed lengths
In this paper, we consider the path (and cycle) partition problem for graphs with additional length restrictions. More specifically, we prove sufficient degree sum conditions for the vertices of a graph to be partitioned into paths, with fixed end vertices, such that these paths have approximately prescribed lengths. We also prove similar results for partitions into cycles of approximately pres...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملOn pseudo 2-factors
We show that a graph with minimum degree δ, independence number α ≥ δ and without isolated vertices, possesses a partition by vertex-disjoint cycles and atmost α−δ+1 edges or vertices. © 2008 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2005